Partitions of points into intersecting tetrahedra

Radon’s theorem asserts that any set S of d + 2 points in [Wd has a partition into two subsets S, and S, such that Conv(S,) rl Conv(S,) # 0, where Conv(Si) denotes the convex hull of Si. This central theorem in the theory of convexity has been extended in many directions. One of the most interesting generalizations is the following theorem, proved by Tverberg in 1966, and now considered as a classical result in combinatorial geometry.